https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 On complexity of lobbying in multiple referenda https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:2613 Wed 11 Apr 2018 15:20:50 AEST ]]> Linear kernels in linear time, or how to save k colours in O(n2) steps https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:3105 Sat 24 Mar 2018 08:33:03 AEDT ]]> Milling a graph with turn costs: a parameterized complexity perspective https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:11740 x at each vertex x giving, for each ordered pair of edges (e,f) incident at x, the turn cost at x of a walk that enters the vertex on edge e and departs on edge f. We describe an initial study of the parameterized complexity of the problem.]]> Sat 24 Mar 2018 08:07:49 AEDT ]]> Tight lower bounds for certain parameterized NP-hard problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:134 Sat 24 Mar 2018 07:43:11 AEDT ]]>